|
|
Diffusion Evolutionary Algorithm
Mészáros, István ; Pospíchal, Petr (referee) ; Jaroš, Jiří (advisor)
There are new trends in artificial intelligence nowadays. Methods known as evolutionary algorithms are one of them. These algorithms allow us to design and optimize systems using computers. One of the variants of evolutionary algorithms is the diffusion evolutionary algorithm. This type of algorithms is able to run in parallel, and besides that it brings many positive features. The question is under what conditions the diffusion variant of evolutionary algorithms can effectively be used. Is it possible to use for planning systems and for problem optimization? Why are they more favorable than other types of evolutionary algorithms? This work tries to answer these questions and explain the behavior of these algorithms.
|
|
|
Parallel Versions of General Parsing
Mikita, Tibor ; Kučera, Jiří (referee) ; Meduna, Alexandr (advisor)
This thesis deals with general parsing methods. The author studies the Cocke-Younger-Kasami algorithm and comes up with a design of a parallel version. The motivation of~the author is the acceleration of parsing based on this algorithm. The result is a console application that can determine whether an input string belongs to a language generated by the input grammar or not on the basis of the designed parallel algorithm. For the programming language, C++ was chosen. To achieve parallelism the work of the algorithm was divided among several threads.
|
|
|
Parallel Application Development with Intel Threading Tools
Vadkerti, Ladislav ; Jaroš, Jiří (referee) ; Dvořák, Václav (advisor)
Today's trend in microprocessor design is increasing the number of execution cores within one single chip. Increasing the processor's clock speed reached its limit with growing power consumption. This trend brings new opportunities to software developers, as they can take advantage of real multithreading in their applications. But a lot of new problems to solve appear with threading compared to sequential programming. With proper design, threading can enhance performance by making better use of hardware resources. However, the improper use of threading can lead to performance degradation, unpredictible behavior, or error conditions that are difficult to solve. For this reason Intel developed a suite of tools, that can help software developers to analyze performance and detect coding errors in thread interactions. This thesis focuses on the examination of ways that this tools can be used in multithreaded application development.
|
|
|
Optimization of the Distributed I/O Subsystem of the k-Wave Project
Vysocký, Ondřej ; Klepárník, Petr (referee) ; Jaroš, Jiří (advisor)
This thesis deals with an effective solution of the parallel I/O of the k-Wave tool, which is designed for time domain acoustic and ultrasound simulations. k-Wave is a supercomputer application, it runs on a Lustre file system and it requires to be implemented with MPI and stores the data in suitable data format (HDF5). I designed three methods of optimization which fits k-Wave's needs. It uses accumulation and redistribution techniques. In comparison with the native write, every optimization method led to better write speed, up to 13.6GB/s. It is possible to use these methods to optimize every data distributed application with the write speed issue.
|
|
|
Lexical Analyzer for Multiprocesor Computers
Otáhal, Jiří ; Goldefus, Filip (referee) ; Čermák, Martin (advisor)
Aim of this thesis is to invent method, which should accelerate speed of the analysis of source texts with multiprocessor computers. For this purpose application runs multiple process in Unix system. Each undergoing process analyzes exact partition in source file and then closes itself. Outcome of this process are internal structures, which presents exact partition. Inter-code is sequentially built from the structures which are subsequently interpreted. This kind of parallel analysis achieves acceleration of speed on the contrary of typical sequential analysis.
|
|
|
.NET's LINQ Optimization
Šerý, Daniel ; Ryšavý, Ondřej (referee) ; Pluskal, Jan (advisor)
This thesis deals with LINQ (Language integrated query) and investigates possibilities of its implementation and optimization in C# language. Method of rewriting of query to procedural code is chosen and implemented. The goal is to provide a LINQ that can be used in code with the need for high speed. Regarding the program created for rewriting LINQ queries, the performance of most operators has been increased by 1.2x to 20x of System.Linq speed depending of rewritten algorithm, data source and provided information to rewriting program.
|
|
|
Techniques for parallel processing in .NET Framework
Hajn, Pavel ; Morský, Ondřej (referee) ; Lattenberg, Ivo (advisor)
This bachelor thesis describes the design of program which uses the techniques of parallel programming. The thesis contents theoretical and practical part. The theoretical part is focused on explaining the basic concepts such as multi-threaded execution of applications on singlecore and multicore processor, topology of threads and methods of parallel programming with using classes ThreadPool and Task Parallel Library, which describes the methods Parallel.For, Parallel.ForEach, Parallel.Invoke and TASK. In the practical section individual functions and specific methods needed for proper functioning of the program are explained, which represent simple archive of web pages. The sites are periodically checked and addresses of this website’s are specified in the configuration file.
|
|
|
Parallel Programming in Rust Language
Šlampa, Ondřej ; Bařina, David (referee) ; Kobrtek, Jozef (advisor)
Topic of this thesis is parallelization in Rust. Aim of this thesis is to compare performance and usability of Rust language with already used alternative - OpenMP. Computation of n-dimensional comvolution was used for benchmark. In conclusion there is evaluation of results and suggestions for their future use.
|
|
|
Coverage-Driven Testing for Multithreaded Programs
Lietavcová, Zuzana ; Šimková, Hana (referee) ; Letko, Zdeněk (advisor)
This work deals with a problem of searching errors in multithreaded programs using a coverage-driven testing technique as perceived in program Maple. The testing consists of two phases. In the first phase of testing a set of coverable behaviours of the tested program is being built. Consequently, the algorithm tries to achieve these behaviours with a help of deterministic test execution. The main acquisition of the work lays in a compact description of Maple including all the technical details. Based on the study of the tool there were weak places identified. Some of them are studied in detail, especially those which use random decision making and prioritizing of the forced behaviours. The result are several modifications of Maple, from which some lead to a higher number of exposed behaviours and higher error exposition in some cases. This is demonstrated on a test suite of parallel programs.
|
|
|
Library for Operations over Finite Automata
Bartůněk, Petr ; Puš, Viktor (referee) ; Kaštil, Jan (advisor)
This work deals with two basic operations over finite automata. Determination of nondeterministic finite automata and minimization of deterministic finite automata. For these two operations I proposed sequential algorithms that are parallelizable. I deal mainly with finding the speedup of SSE instructions, or use the OpenMP library. The trend today is mainly in increasing the number of processors, so I propose parallel algorithms for multiple processors. When searching for the optimal solution, I will be to examine other ways to achieve speedup, for example efficient saving of the data structures in memory.
|
guest ::
